Enhancing eigenvalue approximation by gradient recovery on adaptive meshes
نویسندگان
چکیده
Gradient recovery has been widely used for a posteriori error estimates (see Ainsworth & Oden, 2000; Babuška & Strouboulis, 2001; Chen & Xu, 2007; Fierro & Veeser, 2006; Zhang, 2007; Zienkiewicz et al., 2005; Zienkiewicz & Zhu, 1987, 1992a,b). Recently, it has been employed to enhance the eigenvalue approximations by the finite-element method under certain mesh conditions (see Naga et al., 2006; Shen & Zhou, 2006). However, it was unclear whether the gradient recovery is effective for adaptive meshes. In this paper we prove that under adaptive meshes the recovered gradient still helps to improve the convergence rate of the eigenvalue approximation. Our proof relies on the superconvergence result for adaptive meshes established in Wu & Zhang (2007). Furthermore, we demonstrate the effectiveness of the gradient recovery in enhancing eigenvalue approximation by two typical numerical examples: the Laplace operator on the L-shaped domain and the cracked domain. In both cases, we observe superconvergence rates for eigenvalue approximation. We would like to indicate that the enhancement can be applied to more general problems, see, e.g., Shen & Zhou (2006). Likewise, our results on adaptive meshes in this paper can be generalized. Due to the nonquasi-uniform nature of adaptive meshes, error estimates depend on the total degrees of freedom N , rather than the mesh size h (see Bangerth & Rannacher, 2003; Binev et al., 2004; Dörfler, 1996; Morin et al., 2002; Verfürth, 1995). Therefore, the standard analysis for h-version finite-element eigenvalue approximation cannot be used directly and some modifications are needed.
منابع مشابه
Enhancing Eigenvalue Approximation by Gradient Recovery
The polynomial preserving recovery (PPR) is used to enhance the finite element eigenvalue approximation. Remarkable fourth order convergence is observed for linear elements under structured meshes as well as unstructured initial meshes (produced by the Delaunay triangulation) with the conventional bisection refinement.
متن کاملCan We Have Superconvergent Gradient Recovery Under Adaptive Meshes?
~ We study. adaptive finite element methods for elliptic problems with domain corner singularities. Our model problem is the two dimensional Poisson equation. Results of this paper are two folds. First, we prove that there exists an adaptive mesh (gauged by a discrete mesh density function) under which the recovered.gradient by the Polynomial Preserving Recovery (PPR) is superconvergent. Second...
متن کاملHessian-free metric-based mesh adaptation via geometry of interpolation error
Generation of meshes adapted to a given function u requires a specially designed metric. For metric derived from the Hessian of u, optimal error estimates for the interpolation error on simplicial meshes have been proved in [2, 5, 8, 10, 11]. The Hessian-based metric has been successfully applied to adaptive solution of PDEs [4, 7, 9]. However, theoretical estimates have required to make an add...
متن کاملGuaranteed lower bounds for eigenvalues
This paper introduces fully computable two-sided bounds on the eigenvalues of the Laplace operator on arbitrarily coarse meshes based on some approximation of the corresponding eigenfunction in the nonconforming Crouzeix-Raviart finite element space plus some postprocessing. The efficiency of the guaranteed error bounds involves the global mesh-size and is proven for the large class of graded m...
متن کاملAn eigenvalue study on the sufficient descent property of a modified Polak-Ribière-Polyak conjugate gradient method
Based on an eigenvalue analysis, a new proof for the sufficient descent property of the modified Polak-Ribière-Polyak conjugate gradient method proposed by Yu et al. is presented.
متن کامل